Carmichael number について

₁ of the Knödel numbers.
==Overview==
Fermat's little theorem states that if ''p'' is a prime number, then for any integer ''b'', the number ''b''^''p'' − ''b'' is an integer multiple of ''p''. Carmichael numbers are composite numbers which have the same property of modular arithmetic congruence. In fact, Carmichael numbers are also called Fermat pseudoprimes or absolute Fermat pseudoprimes. Carmichael numbers are important because they pass the Fermat primality test but are not actually prime. Since Carmichael numbers exist, this primality test cannot be relied upon to prove the primality of a number, although it can still be used to prove a number is composite. This makes tests based on Fermat's Little Theorem risky compared to other more stringent tests such as the Solovay-Strassen primality test or a strong pseudoprime test. Still, as numbers become larger, Carmichael numbers become very rare. For example, there are 20,138,200 Carmichael numbers between 1 and 10²¹ (approximately one in 50 trillion (5
*10¹³) numbers).〔Richard Pinch, ("The Carmichael numbers up to 10²¹" ), May 2007.〕

抄文引用元・出典: フリー百科事典『ウィキペディア（Wikipedia）』
■ウィキペディアで「Carmichael number」の詳細全文を読む

スポンサードリンク

翻訳と辞書 : 翻訳のためのインターネットリソース